class Solution:
    def isMatch(self, s: str, p: str) -> bool:
        return False


if __name__ == '__main__':
    so = Solution()
    s = ""
    p = ""
    r = so.isMatch(s, p)
    print(r)


# Definition for singly-linked list.
class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None

    def __str__(self):
        return str(self.val)


def buildListNode(nodes):
    print(nodes)
    a = []
    for val in nodes:
        a.append(ListNode(val))

    for i in range(len(a) - 1):
        a[i].next = a[i + 1]
    return a[0]


# Definition for a binary tree node.
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

    def __str__(self):
        return str(self.val)

# def buildTreeNode(nodes):
#     print(nodes)
#     a = []
#     for val in nodes:
#         a.append(ListNode(val))
#
#     for i in range(len(a) - 1):
#         a[i].next = a[i + 1]
#     return a[0]

#     s = """
# -2 -3 3
# -5 -10 1
# 10 30 -5"""
#     s = s[1:]
#     s = s.split("\n")
#     s = [x.split(" ") for x in s]
#     s = [[int(y) for y in x] for x in s]
#     print(s)
